K6 minors in large 6-connected graphs
نویسندگان
چکیده
Jørgensen conjectured that every 6-connected graph G with no K6 minor has a vertex whose deletion makes the graph planar. We prove the conjecture for all sufficiently large graphs. 8 April 2005, revised 22 May 2009. Partially supported by NSF under Grant No. DMS-0200595. Partially supported by NSF under Grants No. DMS-0200595 and. DMS-0354742.
منابع مشابه
K6-Minors in Projective Planar Graphs
It is shown that every 5-connected graph embedded in the projective plane with face-width at least 3 contains the complete graph on 6 vertices as a minor.
متن کاملK_6 minors in 6-connected graphs of bounded tree-width
We prove that every sufficiently big 6-connected graph of bounded treewidth either has a K6 minor, or has a vertex whose deletion makes the graph planar. This is a step toward proving that the same conclusion holds for all sufficiently big 6-connected graphs. Jørgensen conjectured that it holds for all 6-connected graphs. 8 April 2005, revised 4 September 2008. Partially supported by NSF under ...
متن کاملK6-Minors in Triangulations on the Klein Bottle
In this paper, we shall characterize triangulations on the Klein bottle without K6-minors. Our characterization implies that every 5-connected triangulation on the Klein bottle has a K6-minor. The connectivity “5” is best possible in a sense that there is a 4-connected triangulation on the Klein bottle without K6-minors.
متن کاملK6-Minors in Triangulations on the Nonorientable Surface of Genus 3
It is easy to characterize graphs with no Kk-minors for any integer k ≤ 4, as follows. For k = 1, 2, the problem must be trivial, and for k = 3, 4, those graphs are forests and series-parallel graphs (i.e., graphs obtained from K3 by a sequence of replacing a vertex of degree 2 with a pair of parallel edges, or its inverse operation.) Moreover, Wagner formulated a fundamental characterization o...
متن کاملOn 3-Connected Graphs of Path-Width at Most Three
It is known that the list of excluded minors for the minor-closed class of graphs of path-width 6 3 numbers in the millions. However, if we restrict the class to 3-connected graphs of path-width 6 3, then we can characterize it by five excluded minors.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 129 شماره
صفحات -
تاریخ انتشار 2018